Percolation on bipartite scale-free networks
نویسندگان
چکیده
منابع مشابه
Biased percolation on scale-free networks.
Biased (degree-dependent) percolation was recently shown to provide strategies for turning robust networks fragile and vice versa. Here, we present more detailed results for biased edge percolation on scale-free networks. We assume a network in which the probability for an edge between nodes i and j to be retained is proportional to (k(i)k(j)(-alpha) with k(i) and k(j) the degrees of the nodes....
متن کاملPercolation of partially interdependent scale-free networks.
We study the percolation behavior of two interdependent scale-free (SF) networks under random failure of 1-p fraction of nodes. Our results are based on numerical solutions of analytical expressions and simulations. We find that as the coupling strength between the two networks q reduces from 1 (fully coupled) to 0 (no coupling), there exist two critical coupling strengths q(1) and q(2), which ...
متن کاملPercolation in directed scale-free networks.
Many complex networks in nature have directed links, a property that affects the network's navigability and large-scale topology. Here we study the percolation properties of such directed scale-free networks with correlated in and out degree distributions. We derive a phase diagram that indicates the existence of three regimes, determined by the values of the degree exponents. In the first regi...
متن کاملExplosive percolation in scale-free networks.
We study scale-free networks constructed via a cooperative Achlioptas growth process. Links between nodes are introduced in order to produce a scale-free graph with given exponent lambda for the degree distribution, but the choice of each new link depends on the mass of the clusters that this link will merge. Networks constructed via this biased procedure show a percolation transition which str...
متن کاملPercolation critical exponents in scale-free networks.
We study the behavior of scale-free networks, having connectivity distribution P(k) approximately k(-lambda), close to the percolation threshold. We show that for networks with 3<lambda<4, known to undergo a transition at a finite threshold of dilution, the critical exponents are different than the expected mean-field values of regular percolation in infinite dimensions. Networks with 2<lambda<...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2010
ISSN: 0378-4371
DOI: 10.1016/j.physa.2009.12.068